Batch processing with interval graph compatibilities between tasks
نویسندگان
چکیده
منابع مشابه
Batch processing with interval graph compatibilities between tasks
We analyze batch-scheduling problems that arise in connection with certain industrial applications. The models concern processing on a single max-batch machine with the additional feature that the tasks of the same batch have to be compatible. Compatibility is a symmetric binary relation—the compatible pairs are described with an undirected “compatibility graph”, which is often an interval grap...
متن کاملCapacitated max -Batching with Interval Graph Compatibilities
We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in the clique. This natural graph problem can be interpreted as a batch scheduling problem. Solving an open question from [7, 4, 5], we show NP-hardness, even if the bound on the clique sizes is constant. Moreover, we gi...
متن کاملCoupled-Tasks in Presence of Bipartite Compatibilities Graphs
We tackle the makespan minimization coupled-tasks problem in presence of incompatibility constraints. In particular, we focus on stretched coupled-tasks, i.e.coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, . . .). In such ...
متن کاملInterval Graph Representation with Given Interval and Intersection Lengths
We consider the problem of finding interval representations of graphs that additionally respect given interval lengths and/or pairwise intersection lengths, which are represented as weight functions on the vertices and edges, respectively. Pe’er and Shamir proved that the problem is NP-complete if only the former are given [SIAM J. Discr. Math. 10.4, 1997]. We give both a linear-time and a logs...
متن کاملDesktop Batch Processing
Today, online transaction processing applications can downsize from mainframes to microprocessors. Commodity database systems, operating systems, and hardware came of age in 1993., -they surpassed the online transaction processing performance of proprietary solutions. There are lingering doubts about downsizing batch transaction processing applications. The doubts center on the ability of micro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.03.039